Adaptive Quad Mesh Simplification
نویسندگان
چکیده
We present an improved algorithm for the progressive simplification of quad meshes, which adapts the resolution of the mesh to details of the modeled shape. We extend previous work [TPC∗10], by simplifying the approach and combining it with the concept of Fitmaps introduced in [PPT∗10]. The new algorithm has several advantages: it is simpler and more robust; it does not need a parametrization of the input shape; it is adaptive; and it preserves projectability of the output mesh to the input shape, thus supporting displacement mapping. We present experimental results on a variety of datasets, showing relevant improvement over previous results under several aspects.
منابع مشابه
Practical quad mesh simplification
In this paper we present an innovative approach to incremental quad mesh simplification, i.e. the task of producing a low complexity quad mesh starting from a high complexity one. The process is based on a novel set of strictly local operations which preserve quad structure. We show how good tessellation quality (e.g. in terms of vertex valencies) can be achieved by pursuing uniform length and ...
متن کاملQuad-Mesh Generation and Processing: A Survey
Triangle meshes have been nearly ubiquitous in computer graphics, and a large body of data structures and geometry processing algorithms based on them has been developed in the literature. At the same time, quadrilateral meshes, especially semi-regular ones, have advantages for many applications, and significant progress was made in quadrilateral mesh generation and processing during the last s...
متن کاملSemi-regular Quadrilateral-only Remeshing from Simplified Base Domains
Semi-regular meshes describe surface models that exhibit a structural regularity that facilitates many geometric processing algorithms. We introduce a technique to construct semi-regular, quad-only meshes from input surface meshes of arbitrary polygonal type and genus. The algorithm generates a quad-only model through subdivision of the input polygons, then simplifies to a base domain that is h...
متن کاملImplicit Hierarchical Quad-Dominant Meshes
We present a method for producing quad-dominant subdivided meshes, which supports both adaptive refinement and adaptive coarsening. A hierarchical structure is stored implicitly in a standard half-edge data structure, while allowing us to efficiently navigate through the different level of subdivision. Subdivided meshes contain a majority of quad elements and a moderate amount of triangles and ...
متن کاملCompletely Adaptive Simplification of Massive Meshes
The growing availability of massive models and the inability of most existing visualization tools to work with them requires efficient new methods for massive mesh simplification. In this paper, we present a completely adaptive, virtual memory based simplification algorithm for large polygonal datasets. The algorithm is an enhancement of RSimp [2], enabling out of core simplification without re...
متن کامل